Parallelized Quantum Monte Carlo Algorithm with Nonlocal Worm Updates
نویسندگان
چکیده
منابع مشابه
Parallelized quantum Monte Carlo algorithm with nonlocal worm updates.
Based on the worm algorithm in the path-integral representation, we propose a general quantum Monte Carlo algorithm suitable for parallelizing on a distributed-memory computer by domain decomposition. Of particular importance is its application to large lattice systems of bosons and spins. A large number of worms are introduced and its population is controlled by a fictitious transverse field. ...
متن کاملContinuous-time quantum Monte Carlo using worm sampling
P. Gunacker,1 M. Wallerberger,1 E. Gull,2 A. Hausoel,3 G. Sangiovanni,3 and K. Held1 1Institute for Solid State Physics, Vienna University of Technology, 1040 Vienna, Austria 2Department of Physics, University of Michigan, Ann Arbor, Michigan 48109, USA 3Institute for Theoretical Physics and Astrophysics, University of Würzburg, Am Hubland 97074 Würzburg, Germany (Received 22 June 2015; publish...
متن کاملWorm algorithm for continuous-space path integral monte carlo simulations.
We present a new approach to path integral Monte Carlo (PIMC) simulations based on the worm algorithm, originally developed for lattice models and extended here to continuous-space many-body systems. The scheme allows for efficient computation of thermodynamic properties, including winding numbers and off-diagonal correlations, for systems of much greater size than that accessible to convention...
متن کاملA fast and efficient algorithm for Slater determinant updates in quantum Monte Carlo simulations.
We present an efficient low-rank updating algorithm for updating the trial wave functions used in quantum Monte Carlo (QMC) simulations. The algorithm is based on low-rank updating of the Slater determinants. In particular, the computational complexity of the algorithm is O(kN) during the kth step compared to traditional algorithms that require O(N(2)) computations, where N is the system size. ...
متن کاملQuantum algorithm for exact Monte Carlo sampling.
We build a quantum algorithm which uses the Grover quantum search procedure in order to sample the exact equilibrium distribution of a wide range of classical statistical mechanics systems. The algorithm is based on recently developed exact Monte Carlo sampling methods, and yields a polynomial gain compared to classical procedures.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review Letters
سال: 2014
ISSN: 0031-9007,1079-7114
DOI: 10.1103/physrevlett.112.140603